Circulant graphs: recognizing and isomorphism testing in polynomial time
نویسندگان
چکیده
منابع مشابه
Circulant Graphs: Recognizing and Isomorphism Testing in Polynomial Time
An algorithm is constructed for recognizing the circulant graphs and finding a canonical labeling for them in polynomial time. This algorithm also yields a cycle base of an arbitrary solvable permutation group. The consistency of the algorithm is based on a new result on the structure of Schur rings over a finite cyclic group. §
متن کاملRecognizing Circulant Graphs of Prime Order in Polynomial Time Recognizing Circulant Graphs of Prime Order in Polynomial Time
1 Abstract In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant ii its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent connguration A and, in...
متن کاملIsomorphism testing for circulant graphs
In this paper we focus on connected directed/undirected circulant graphs Cn(a, b). We investigate some topological characteristics, and define a simple combinatorial model, which is new for the topic. Building on such a model, we derive a necessary and sufficient condition to test whether two circulant graphs Cn(a, b) and Cn(a , b) are isomorphic or not. The method is entirely elementary and co...
متن کاملRecognizing Circulant Graphs of Prime Order in Polynomial Time
In this paper we present a time-polynomial recognition algorithm for circulant graphs of prime order. A circulant graphG of order n is a Cayley graph over the cyclic groupZn: Equivalently, G is circulant i its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a coherent con guration A and, in particular, a S...
متن کاملPolynomial Time Symmetry and Isomorphism Testing for Connected Graphs
Electrical networks and random walks on networks have been the object of study for a while (see Doyle,Snell [2]). Recently these concepts have been taken up by data miners and network analysts to extract useful information from data and networks [3][4][6]. Before this the same techniques where used by computational chemist to label molecules [5]. If one takes Kirchhoff’s Current Law as a given ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: St. Petersburg Mathematical Journal
سال: 2004
ISSN: 1061-0022
DOI: 10.1090/s1061-0022-04-00833-7